Codes, Lattices, and Steiner Systems
نویسنده
چکیده
Two classification schemes for Steiner triple systems on 15 points have been proposed recently: one based on the binary code spanned by the blocks, the other on the root system attached to the lattice affinely generated by the blocks. It is shown here that the two approaches are equivalent. 1991 AMS Classification: Primary: 05B07; Secondary: 11H06, 94B25.
منابع مشابه
Column Weight Two and Three LDPC Codes with High Rates and Large Girths
In this paper, the concept of the broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. Interestingly, the constructed regular cycle codes with row-weights t, 3 ≤ t ≤ 20, t 6= 7, 15, 16, have the best lengths among the known regu...
متن کاملOptimal Doubly Constant Weight Codes
A doubly constant weight code is a binary code of length n1 + n2, with constant weight w1 + w2, such that the weight of a codeword in the first n1 coordinates is w1. Such codes have applications in obtaining bounds on the sizes of constant weight codes with givenminimum distance. Lower and upper bounds on the sizes of such codes are derived. In particular, we show tight connections between opti...
متن کاملOptimal constant weight codes over Zk and generalized designs
We consider optimal constant weight codes over arbitrary alphabets. Some of these codes are derived from good codes over the same alphabet, and some of these codes are derived from block design. Generalizations of Steiner systems play an important role in this context. We give several construction methods for these generalizations. An interesting class of codes are those which form generalized ...
متن کاملAn infinite family of Steiner systems S(2, 4, 2m) from cyclic codes
Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are S(2,3,v) (Steiner triple systems), S(3,4,v) (Steiner quadruple systems), and S(2,4,v). There are a few infinite families of Steiner systems S(2,4,v) in the literature. The objective of this paper is to present an infinite family of Steiner systems S(2,4,2m) for all m ≡ 2 (mod 4)≥ 6 from cyclic codes. ...
متن کاملMaxMinSum Steiner Systems for Access-Balancing in Distributed Storage
Many code families such as low-density parity-check codes, fractional repetition codes, batch codes and private information retrieval codes with low storage overhead rely on the use of combinatorial block designs or derivatives thereof. In the context of distributed storage applications, one is often faced with system design issues that impose additional constraints on the coding schemes, and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 4 شماره
صفحات -
تاریخ انتشار 1997